基于CISE环境的导弹武器仿真系统

数字仿真研究是导弹武器设计验证的有效手段,基于CISE环境设计了导弹武器仿真系统,介绍了CISE环境的特点,给出了仿真系统的模块组成、系统方案、软件界面,设计了系统工作流程和仿真系统各组成模块间信息交互定义及关系,介绍了仿真系统中的中末制导交班流程、攻击区计算流程。该平台各模块间具有良好的独立性和封装性,基于此系统开展了系统建模、作战模式、战技指标论证、逃逸方式等方面研究工作。     

Contracts and coordination: Supply chains with uncertain demand and supply

Considering a supply chain with a supplier subject to yield uncertainty selling to a retailer facing stochastic demand, we find that commonly studied classical coordination contracts fail to coordinate both the supplier's production and the retailer's procurement decisions and achieve efficient performance. First, we study the vendor managed inventory (VMI) partnership. We find that a consignment VMI partnership coupled with a production cost subsidy achieves perfect coordination and a win‐win outcome; it is simple to implement and arbitrarily allocates total channel profit. The production cost subsidy optimally chosen through Nash bargaining analysis depends on the bargaining power of the supplier and the retailer. Further, motivated by the practice that sometimes the retailer and the supplier can arrange a “late order,” we also analyze the behavior of an advance‐purchase discount (APD) contract. We find that an APD with a revenue sharing contract can efficiently coordinate the supply chain as well as achieve flexible profit allocation. Finally, we explore which coordination contract works better for the supplier vs. the retailer. It is interesting to observe that Nash bargaining solutions for the two coordination contracts are equivalent. We further provide recommendations on the applications of these contracts. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 305–319, 2016     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

Technical note: Finite-time regret analysis of Kiefer-Wolfowitz stochastic approximation algorithm and nonparametric multi-product dynamic pricing with unknown demand

We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ₁, κ₂ are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature.     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

基于3D打印的可移植人体外耳支架关键技术研究*

耳廓缺损是临床常见疾病，使用患者自体肋软骨雕刻为耳支架并植入缺损耳皮下是目前的主要治疗方法。该方法对手术者提出很高的技术要求，雕刻的外耳支架无法精确还原患者耳廓形状，同时肋软骨的切除会对患者带来并发症。本文探索使用医用硅胶制作患者个体外耳支架的关键技术，使用CT和逆向建模技术得到对应患者个体的外耳数字模型，利用3D打印技术制造人体外耳支架模具，并使用医用硅胶MED 4735完成人体外耳支架的制作成型。动物实验验证了其生物相容性，证明了该方法的可行性。通过该技术制作的硅胶人体外耳支架可以高度模仿患者特定的耳廓形状，支架精度高，制造周期短，无生物排异，可为替代肋软骨雕刻人体外耳支架进行耳廓缺损治疗提供依据。     

基于ANSYS／LS—DYNA的电子装备爆炸冲击振动损伤建模研究

针对电子装备爆炸冲击振动损伤问题，设计了损伤模拟的基本方案；采用ANSYS／LS—DYNA建立了二维“爆炸源-地面-弹性体-电子装备”模型；通过模型试验，获得了与实际爆炸冲击振动特性相吻合的加速度、位移和应力等数据。     

Integrating decisions with advance supply information in an assemble-to-order system

We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model.     

关于半鞅向量随机积分的两个结果

首先利用半鞅Girsanov定理与闭图像定理证明了:若{Xn}是带滤基的完备概率空间(Ω,F,F,P)中的一列半鞅,其中滤基F=(Ft)t≥0满足通常条件,且{Xn}在关于P的Emery拓扑空间中收敛于X,则当概率测度Q相似文献   

自由漂浮柔性机械臂系统的动力学建模与仿真

动量矩守恒约束使自由漂浮柔性机械臂系统成为非完整系统,其动力学模型通常是难以求解的微分—代数方程,因此提出将机械臂系统等效为一个完整系统进行建模。假设载体存在姿态控制力矩,此时由于不存在动量矩守恒约束,系统变成一个完整系统,采用Lagrange方法建立其动力学方程;令方程中载体的姿态控制力矩为零,即得到自由漂浮机械臂系统的动力学方程;采用数值方法求解动力学方程,并将动力学分析的结果与ADAMS中仿真的结果进行对比,验证了模型能够有效模拟自由漂浮柔性机械臂系统的动力学特性。